A Ga-pso Layered Encoding Evolutionary Approach to 0/1 Knapsack Optimization
نویسندگان
چکیده
This paper presents a layered encoding cascade evolutionary approach to solve a 0/1 knapsack optimization problem. A layered encoding structure is proposed and developed based on the schema theorem and the concepts of cascade correlation and multi-population evolutionary algorithms. Genetic algorithm (GA) and particle swarm optimization (PSO) are combined with the proposed layered encoding structure to form a generic optimization model denoted as LGAPSO. In order to enhance the finding of both local and global optimum in the evolutionary search, the model adopts hill climbing evaluation criteria, feature of strength Pareto evolutionary approach (SPEA) as well as nondominated spread lengthen criteria. Four different sizes benchmark knapsack problems are studied using the proposed LGAPSO model. The performance of LGAPSO is compared to that of the ordinary multi-objective optimizers such as VEGA, NSGA, NPGA and SPEA. The proposed LGAPSO model is shown to be efficient in improving the search of knapsack’s optimum, capable of gaining better Pareto trade-off front.
منابع مشابه
A Comparative Analysis for Determining the Optimal Path using PSO and GA
Significant research has been carried out recently to find the optimal path in network routing. Among them, the evolutionary algorithm approach is an area where work is carried out extensively. We in this paper have used particle swarm optimization (PSO) and genetic algorithm (GA) for finding the optimal path and the concept of region based network is introduced along with the use of indirect e...
متن کاملA New Approach of Backbone Topology Design Used by Combination of GA and PSO Algorithms
A number of algorithms based on the evolutionary processing have been proposed forcommunication networks backbone such as Genetic Algorithm (GA). However, there has beenlittle work on the SWARM optimization algorithms such as Particle Swarm Optimization(PSO) for backbone topology design. In this paper, the performance of PSO on GA isdiscussed and a new algorithm as PSOGA is proposed for the net...
متن کاملQuantum-Inspired Differential Evolution with Particle Swarm Optimization for Knapsack Problem
This paper presents a new hybrid algorithm called QDEPSO (Quantum inspired Differential Evolution with Particle Swarm Optimization) which combines differential evolution (DE), particle swarm optimization method (PSO) and quantum-inspired evolutionary algorithm (QEA) in order to solve the 0-1 optimization problems. In the initialization phase, the QDEPSO uses the concepts of quantum computing as...
متن کاملAn Evolutionary Approach to the Zero/One Knapsack Problem: Testing Ideas from Biology
The transposition mechanism, widely studied by us in previous publications, showed that when used instead of the standard crossover operators, allows the genetic algorithm to achieve better solutions. Nevertheless, all the studies made concerning this mechanism always focused the domain of function optimization. In this paper, we present an empirical study that compares the performances of the ...
متن کاملApproximate Pareto Optimal Solutions of Multi objective Optimal Control Problems by Evolutionary Algorithms
In this paper an approach based on evolutionary algorithms to find Pareto optimal pair of state and control for multi-objective optimal control problems (MOOCP)'s is introduced. In this approach, first a discretized form of the time-control space is considered and then, a piecewise linear control and a piecewise linear trajectory are obtained from the discretized time-control space using ...
متن کامل